package 笔试;

import java.util.HashMap;
import java.util.Scanner;

public class Solution {

//0.5*(1-cos(2*pi*n/N))
    public static void main(String[] args) {
        double pi=3.1415927;

        Scanner sc=new Scanner(System.in);
        int n=sc.nextInt();
        int[] nums=new int[n];
        for (int i=0;i<n;i++){
            nums[i]=sc.nextInt();
        }
        for (int i:nums){
            System.out.print(i+" ");
        }
        for (int i=0;i<n;i++){
            double num= (nums[i]*0.5*(1-Math.cos(Math.toRadians(2*pi*i/32))));

            System.out.print((int)num+" ");
        }

    }
}
//32
//1953 2347 16 -1042 -1546 -933 -1946 -2722 -427 2111 3260 -1265 -8196 -8766 -2922 4135 6564 4644 2726 2789 4939 4451 149 -2320 -1348 2211 3370 900 -886 -1998 -643 172